Verification of Web Services with Timed Automata
نویسندگان
چکیده
منابع مشابه
Verification of Web Services with Timed Automata
In this paper we show how we can use formal methods for describing and analyzing the behavior of Web Services, and more specifically those including time restrictions. Then, our starting point are Web Services descriptions written in WSCI WSCDL (XML-based description languages). These descriptions are then translated into timed automata, and then, we use a well known tool that supports this for...
متن کاملAnalysis and Verification of Web Services Resource Framework (WSRF) Specifications Using Timed Automata
Throughout the history of computing, engineers have used various formal methods to improve the quality of software and hardware. The next natural step is trying to exploit their advantages in the so-called new era of computing: Cloud Computing. In this paper, we present a first approximation about how to simulate and check the behaviour of these systems using timed automata through the model ch...
متن کاملVerification on Interrupt Timed Automata
The class of Interrupt Timed Automata (ITA) has been introduced to model multi-task systems with interruptions in a single processor environment. This is a subclass of hybrid automata in which real valued variables consist of a restricted type of stopwatches (variables with rate 0 or 1) organized along levels. While reachability is undecidable with usual stopwatches, it was proved that this pro...
متن کاملSpecification and Verification of Timed Semantic web Services
It is widely recognized that temporal aspects are indispensable for Web Service modeling. Unfortunately, the current Semantic web Services description languages suffer from the lack of useful concepts needed for timing description. For this purpose, we propose a global methodology for the specification of timing behavior with an extended OWL-S ontology and verification of temporal properties wi...
متن کاملVerification of Asynchronous Circuits using Timed Automata
In this work we apply the timing veriication tool OpenKronos, which is based on timed automata, to verify correctness of numerous asynchronous circuits. The desired behavior of these circuits is speciied in terms of signal transition graphs (STG) and we check whether the synthesized circuits behave correctly under the assumption that the inputs satisfy the STG conventions and that the gate dela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2006
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2005.12.042